考虑罚金政策的众包物流服务质量网络均衡模型

为优化众包物流服务质量,考虑平台罚金政策,构建了包括发包方、众包平台和接包方在内的三层众包物流服务网络模型,并进行算例分析。结果表明,众包平台实施罚金政策并加大自身服务质量投入成本会促使接包方改善自身的服务质量,众包平台的服务质量和利润随之增大,但一味的增大罚金不但会使得接包方利润下降,众包平台的服务质量和利润也呈稍微下降趋势,因此平台应该选择合适的罚金区间;平台在竞争的同时也要进行一定的合作,因为平台间同步协调改进罚金政策以及质量投入会取得更大的收益和更高的平均服务质量。     

线型/圈型网络上单台车辆分群调度问题

本文研究线型/圈型网络上单台车辆分群调度问题。给定一个线型/圈型网络,若干客户分布其中。所有客户被划分成若干个子集,每个子集称为一个群。每个客户有一个释放时间和一个服务时间。给定一台车辆,其需要服务所有客户,且每个群内的客户连续服务。问题的要求是计算一个时间表,使得车辆能够按要求服务完所有客户并返回初始出发位置所花费的时间最少。针对该问题,就线型网络和圈型网络,分别给出一个7/4和一个13/7近似算法。     

联合勤务保障体系网络化建模与研究方法

为了研究联合勤务保障体系在作战行动中的作用,并为体系作战建立网络化的研究方法,提出了一种包含联合勤务网络的四层复杂作战网络,建立了相应的网络化模型。首先,对联合勤务保障体系进行了网络化的定义与描述,得到了认知域、信息域、物理域、联合勤务网络内每个节点的状态属性值;然后,建立了不同网络之间的涌现性模型,提出了作战链与勤务保障链的概念,通过定义涌现满足度曲线,得到了每个节点的网络涌现程度值;最后,针对同层网络和不同层网络分别提出了对应的网络体系同步能力提高方法。研究结果表明:建立的网络化模型与提高同步能力的方法合理有效,对于体系作战的量化研究有一定的实践意义。     

Immanant positivity for Catalan-Stieltjes matrices

We give some sufficient conditions for the nonnegativity of immanants of square submatrices of Catalan-Stieltjes matrices and their corresponding Hankel matrices. To obtain these sufficient conditions, we construct new planar networks with a recursive nature for Catalan-Stieltjes matrices. As applications, we provide a unified way to produce inequalities for many combinatorial polynomials, such as the Eulerian polynomials, Schröder polynomials, and Narayana polynomials.     

Set controllability of Markov jump switching Boolean control networks and its applications

In this article, a novel method is proposed for investigating the set controllability of Markov jump switching Boolean control networks (MJSBCNs). Specifically, the switching signal is described as a discrete-time homogeneous Markov chain. By resorting to the expectation and switching indicator function, an expectation system is constructed. Based on the expectation system, a novel verifiable condition is established for solving the set reachability of MJSBCNs. With the newly obtained results on set reachability, a necessary and sufficient condition is further derived for the set controllability of MJSBCNs. The obtained results are applied to Boolean control networks with Markov jump time delays. Examples are demonstrated to justify the theoretical results.     

Countable network weight and multiplication of Borel sets

A space Borel multiplies with a space if each Borel set of is a member of the -algebra in generated by Borel rectangles. We show that a regular space Borel multiplies with every regular space if and only if has a countable network. We give an example of a Hausdorff space with a countable network which fails to Borel multiply with any non-separable metric space. In passing, we obtain a characterization of those spaces which Borel multiply with the space of countable ordinals, and an internal necessary and sufficient condition for to Borel multiply with every metric space.

     

Approximate minimum-cost multicommodity flows in\tilde O(ɛ −2 KNM) timetime

We show that an ε-approximate solution of the cost-constrainedK-commodity flow problem on anN-nodeM-arc network,G can be computed by sequentially solving O(K(? ^?2+logGK) logGM log (G? ^?1 GK)) single-commodity minimum-cost flow problems on the same network. In particular, an approximate minimum-cost multicommodity flow can be computed in $\tilde O$ (G? ^?2 GKNM) running time, where the notation Õ(·) means “up to logarithmic factors”. This result improves the time bound mentioned by Grigoriadis and Khachiyan [4] by a factor ofM/N and that developed more recently by Karger and Plotkin [8] by a factor of? ^?1. We also provide a simple $\tilde O$ (NM)-time algorithm for single-commodity budget-constrained minimum-cost flows which is $\tilde O$ (? ^?3) times faster than the algorithm developed in the latter paper.     

The matched queueing network PH/M/c→oPH/PH/1

We consider a matched queueing network PH/M/coPH/PH/1, where the output of the first subsystem PH/M/c is regarded as one of the inputs of the second subsystem and matched with another input of PH-renewal process, and they are served by a single server with PH-service-distribution. The stationary state probabilities, the distribution of the virtual waiting times in the two subsystems, and the distribution of the total virtual waiting time are derived.The work was supported by the Max-Planck-Gesellschaft, Germany, and the Chinese Academy ofSciences.     

偏最小二乘-速差动力学分光光度法同时测定杀虫剂残杀威和异丙威两组分

采用速差动力学分光光度法对氨基甲酸脂类杀虫剂残杀威和异丙威进行同时测定，这两种化 的能在碱性条件下水解生成酚盐，进而与对氨基苯酚及高碘酸钾的反应产物醌亚胺发生偶联反应，生成蓝色化合物。反应的速率适中，可用于动力学分析。实验采集了多个时间点下538－700nm间的动力学－吸光度数据，构成量测矩阵，并采用偏最小二乘（PLS）法对量测数据进行解析。本文还对合成样品和环境水样中的残杀威和异丙威含量进行测定，获较好的结果。     

Repeat Space Theory Applied to Carbon Nanotubes and Related Molecular Networks. I

The present article is the first part of a series devoted to extending the Repeat Space Theory (RST) to apply to carbon nanotubes and related molecular networks. Four key problems are formulated whose affirmative solutions imply the formation of the initial investigative bridge between the research field of nanotubes and that of the additivity and other network problems studied and solved by using the RST. All of these four problems are solved affirmatively by using tools from the RST. The Piecewise Monotone Lemmas (PMLs) are cornerstones of the proof of the Fukui conjecture concerning the additivity problems of hydrocarbons. The solution of the fourth problem gives a generalized analytical formula of the pi-electron energy band curves of nanotube (a, b), with two new complex parameters c and d. These two parameters bring forth a broad class of analytic curves to which the PMLs and associated theoretical devices apply. Based on the above affirmative solutions of the problems, a central theorem in the RST, called the asymptotic linearity theorem (ALT) has been applied to nanotubes and monocyclic polyenes. Analytical formulae derived in this application of the ALT illuminate in a new global context (i) the conductivity of nanotubes and (ii) the aromaticity of monocyclic polyenes; moreover an analytical formula obtained by using the ALT provides a fresh insight into Hückel’s (4n+2) rule. The present article forms a foundation of the forthcoming articles in this series. The present series of articles is closely associated with the series of articles entitled ‘Proof of the Fukui conjecture via resolution of singularities and related methods’ published in the JOMC.